CGL Review MeetingGradient-free optimization with Random Pursuit Sebastian U. Sticha,b , Christian L. M¨ ullera,b , Bernd G¨artnera Institute of Theoretical Computer Science

Source URL: sstich.ch

Procedia Computer Science Theoretical Computer Science–14 Bounds On Contention Management Algorithms1 Johannes Schneider, Roger Wattenhofer

Source URL: disco.ethz.ch

Georg Heeg eK Baroper StrDortmund Germany Tel: +Fax: +

Source URL: www.heeg.de

• Software engineering
• Theoretical computer science
• Computing
• VisualWorks
• Cincom Systems
• Wavefront .obj file
• ALK
• OBJ

Crowdsourcing General Computation Haoqi Zhang∗ , Eric Horvitz† , Rob C. Miller‡ , and David C. Parkes∗ ∗ Harvard SEAS Cambridge, MA 02138, USA {hq, parkes}@eecs.harvard.edu

Source URL: crowdresearch.org

• Algorithms
• Engineering
• Academia
• Applied mathematics
• Operations research
• Mathematical logic
• Theoretical computer science
• Human-based computation
• Divide and conquer algorithms
• Crowdsourcing
• Problem solving
• Computer science

1 Abstraction as a Means for End-User Computing in Creative Applications Mira Balaban () Eli Barzilay ()

Source URL: barzilay.org

• Abstraction
• Theoretical computer science
• Lambda calculus
• Software engineering
• Cognitive science
• Models of computation
• Logic in computer science
• Data management
• Combinatory logic
• Factory
• Deductive lambda calculus

Theory of Evolutionary Algorithms for Combinatorial Optimisation Pietro S. Oliveto University of Sheffield Midlands Graduate School

Source URL: staffwww.dcs.shef.ac.uk

• Computational complexity theory
• Analysis of algorithms
• Cybernetics
• Evolution
• Evolutionary algorithm
• Time complexity
• Theoretical computer science
• Computer science
• Applied mathematics

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

Source URL: www.mancoosi.org

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Operations research
• Logic in computer science
• Mathematical optimization
• NP-complete problems
• Boolean algebra
• Maximum satisfiability problem
• Boolean satisfiability problem
• Constraint satisfaction
• Solver

Decoherence and the Transition from Quantum to Classical—Revisited Wojciech H. Zurek This paper has a somewhat unusual origin and, as a consequence, an unusual structure. It is built on the principle embraced by famil

Source URL: cqi.inf.usi.ch

• Physics
• Quantum mechanics
• Quantum measurement
• Theoretical computer science
• Quantum information science
• Interpretations of quantum mechanics
• Quantum decoherence
• Quantum discord
• Quantum computing
• Quantum entanglement
• Measurement in quantum mechanics
• Many-worlds interpretation

In pursuit of decidable ‘logical form’ Michael Minock TCS/CSC KTH Royal Institute of Technology, Stockholm, Sweden Abstract

Source URL: www2.lingfil.uu.se

• Logic
• Mathematical logic
• Theoretical computer science
• Natural language processing
• Formal methods
• Computability theory
• Artificial intelligence
• Decidability
• First-order logic
• Natural language understanding
• Natural language user interface
• Entityrelationship model

Radboud Universiteit Nijmegen Master Thesis Mathematics Scheduling with job dependent machine speed

Source URL: www.math.ru.nl

• Economy
• Business
• Scheduling
• Operations research
• Theoretical computer science
• Manufacturing
• Planning
• Notation for theoretic scheduling problems
• Single-machine scheduling
• Algorithm
• Job shop scheduling
• Flow shop scheduling